Proof internalization in generalized Frege systems for classical logic
نویسنده
چکیده
We present a general method for inserting proofs in Frege systems for classical logic that produces systems that can internalize their own proofs.
منابع مشابه
Proof complexity of intuitionistic implicational formulas
We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic extended Frege (EF ) or substitution Frege (SF ) proofs up to a polynomial. On the other hand, EF proofs in the implicational fragment of IPC p...
متن کاملResolution Proofs of Generalized Pigeonhole Principles
We extend results of A. Haken to give an exponential lower bound on the size of resolution proofs for propositional formulas encoding a generalized pigeonhole principle. These propositional formulas express the fact that there is no one-one mapping from c ·n objects to n objects when c > 1. As a corollary, resolution proof systems do not p -simulate constant formula depth Frege proof systems.
متن کاملThe Deduction Rule and Linear and Near-Linear Proof Simulations
We introduce new proof systems for propositional logic, simple deduction Frege systems, general deduction Frege systems and nested deduction Frege systems, which augment Frege systems with variants of the deduction rule. We give upper bounds on the lengths of proofs in Frege proof systems compared to lengths in these new systems. As applications we give near-linear simulations of the propositio...
متن کاملPropositional Consistency Proofs
Partial consistency statements can be expressed as polynomial-size propositional formulas. Frege proof systems have polynomial-size partial self-consistency proofs. Frege proof systems have polynomialsize proofs of partial consistency of extended Frege proof systems if and only if Frege proof systems polynomially simulate extended Frege proof systems. We give a new proof of Reckhow’s theorem th...
متن کاملA lower bound for intuitionistic logic
We give an exponential lower bound on number of proof-lines in intuitionistic propositional logic, IL, axiomatised in the usual Frege-style fashion; i.e., we give an example of IL-tautologies A1, A2, . . . s.t. every IL-proof of Ai must have a number of proof-lines exponential in terms of the size of Ai. We show that the results do not apply to the system of classical logic and we obtain an exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 165 شماره
صفحات -
تاریخ انتشار 2014